Optimizing glass coating lines: MIP model and valid inequalities

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Valid inequalities for a single constrained 0-1 MIP set intersected with a conflict graph

In this paper a mixed integer set resulting from the intersection of a single constrained mixed 0-1 set with the vertex packing set is investigated. This set arises as a subproblem of more general mixed integer problems such as inventory routing and facility location problems. Families of strong valid inequalities that take into account the structure of the simple mixed integer set and that of ...

متن کامل

Generating Minimal Valid Inequalities

We consider the problem of generating a lattice-free convex set to find a valid inequality that minimizes the sum of its coefficients for 2-row simplex cuts. Multi-row simplex cuts has been receiving considerable attention recently and we show that a pseudo-polytime generation of a lattice-free convex set is possible. We conclude with a short numerical study.

متن کامل

Hydroxyapatite coating on - - zlrconlausing glass coating technique

The aim of this study was to deyelop a noyel hydroxyapatite (HA) coating method on zirconia using glass coating technique. A borosi)icate glass, the mixture of the glass ttnd HA (3e, 50, 70, and 90 mass%), and the 100% HA were coated on two kinds of zirconia discs and fired at 900-950'C. After the final coating, the surface of the sample was etched for 3 min in an acid-mixture of 3% HF and 5%HN...

متن کامل

Bilevel Programming and Maximally Violated Valid Inequalities

In recent years, branch-and-cut algorithms have become firmly established as the most effective method for solving generic mixed integer linear programs (MIPs). Methods for automatically generating inequalities valid for the convex hull of solutions to such MIPs are a critical element of branch-and-cut. This paper examines the nature of the so-called separation problem, which is that of generat...

متن کامل

Valid inequalities for mixed integer linear programs

This tutorial presents a theory of valid inequalities for mixed integer linear sets. It introduces the necessary tools from polyhedral theory and gives a geometric understanding of several classical families of valid inequalities such as lift-and-project cuts, Gomory mixed integer cuts, mixed integer rounding cuts, split cuts and intersection cuts, and it reveals the relationships between these...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: European Journal of Operational Research

سال: 2010

ISSN: 0377-2217

DOI: 10.1016/j.ejor.2009.06.027